Polynomial Distributions and Transformations
نویسندگان
چکیده
Polynomials are common algebraic structures, which often used to approximate functions, such as probability distributions. This paper proposes directly define polynomial distributions in order describe stochastic properties of systems rather than assume polynomials for only approximating known or empirically estimated Polynomial offer great modeling flexibility and mathematical tractability. However, unlike canonical distributions, functions may have non-negative values the intervals support some parameter values; their numbers usually much larger interval must be finite. Hence, defined here assuming three forms a function. Transformations approximations histograms by also considered. The key derived closed form. A piecewise distribution construction is devised ensure that it over interval. goodness-of-fit measure proposed determine best polynomial. Numerical examples include estimation parameters generating polynomially distributed samples.
منابع مشابه
On Polynomial Transformations For Simulating Multivariate Non-normal Distributions
Procedures are introduced and discussed for increasing the computational and statistical efficiency of polynomial transformations used in Monte Carlo or simulation studies. Comparisons are also made between polynomials of order three and five in terms of (a) computational and statistical efficiency, (b) the skew and kurtosis boundary, and (c) boundaries for Pearson correlations. It is also show...
متن کاملTransformations of Biased Distributions
Most approaches to reducing (or eliminating) the use of randomness in probabilistic algorithms can be viewed as attempts to replace the probability space from which the algorithm samples by a much smaller one. The use of limited independence among the random choices of the algorithm has long been used as a technique for constructing small spaces that \approximate" the exponential-sized spaces r...
متن کاملPolynomial Time Samplable Distributions
This paper studies distributions which can be \approximated" by sampling algorithms in time polynomial in the length of their outputs. First, it is known that if polynomial-time samplable distributions are polynomial-time computable, then NP collapses to P. This paper shows by a simple counting argument that every polynomial-time samplable distribution is computable in polynomial time if and on...
متن کاملTransformations of Standard Uniform Distributions
We have seen that the R function runif uses a random number generator to simulate a sample from the standard uniform distribution UNIF(0, 1). All of our simulations use standard uniform random variables or are based on transforming such random variables to obtain other distributions of interest. Included in the R language are some functions that implement suitable transformations. For example, ...
متن کاملVariational Inference via Transformations on Distributions
Variational inference methods often focus upon the problem of efficient model optimization, with little emphasis on the choice of the approximating posterior. In this paper we review and implement the various methods that enable us to develop a rich family of approximating posteriors. We show that one particular method employing transformations on distributions, results in developing very rich ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11040985